The expertocratic shortcut

Applicative Shortcut Fusion

In functional programming one usually writes programs as the composition of simpler functions. Consequently, the result of a function might be generated only to be consumed immediately by another function. This potential source of inefficiency can often be eliminated using a technique called shortcut fusion, which fuses both functions involved in a composition to yield a monolithic one. In this...

Shortcut Removal On SHARC

Shortcut Sequence Tagging

Deep stacked RNNs are usually hard to train. Recent studies have shown that shortcut connections across different RNN layers bring substantially faster convergence. However, shortcuts increase the computational complexity of the recurrent computations. To reduce the complexity, we propose the shortcut block, which is a refinement of the shortcut LSTM blocks. Our approach is to replace the self-...

Evaluating the Efficiency of Shortcut Span Protection

This paper presents a comparison of various recovery methods in terms of capacity efficiency with the underlying aim of reducing control plane load. In particular, a method where recovery requests are bundled towards the destination (Shortcut Span Protection) is evaluated can compared against traditional recovery methods. The optimization model is presented and our simulation results show that ...

The Shortcut Problem - Complexity and Algorithms

We study a graph-augmentation problem arising from a technique applied in recent approaches for route planning. Many such methods enhance the graph by inserting shortcuts, i.e., additional edges (u,v) such that the length of (u,v) is the distance from u to v. Given a weighted, directed graph G and a number c ∈ Z>0, the shortcut problem asks how to insert c shortcuts into G such that the expecte...